Comparative Study of Search Engine Result Visualisation: Ranked Lists Versus Graphs
نویسندگان
چکیده
Typically search engine results (SERs) are presented in a ranked list of decreasing estimated relevance to user queries. While familiar to users, ranked lists do not show inherent connections between SERs, e.g. whether SERs are hyperlinked or authored by the same source. Such potentially useful connections between SERs can be displayed as graphs. We present a preliminary comparative study of ranked lists vs graph visualisations of SERs. Experiments with TREC web search data and a small user study of 10 participants show that ranked lists result in more precise and also faster search sessions than graph visualisations.
منابع مشابه
On Selective Result Merging in a Metasearch Enviroment
When a query is passed to multiple search engines, each search engine returns a ranked list of documents. The problem of metasearch is to fuse these ranked lists such that optimal performance is achieved because of the combination. There are two parts of the metasearch process. The first part is to select which search engine results are to be merged. The second part is the actual process of mer...
متن کاملHow Relevant is the Long Tail? - A Relevance Assessment Study on Million Short
Users of web search engines are known to mostly focus on the top ranked results of the search engine result page. While many studies support this well known information seeking pattern only few studies concentrate on the question what users are missing by neglecting lower ranked results. To learn more about the relevance distributions in the so-called long tail we conducted a relevance assessme...
متن کاملDynamical Clustering of Personalized Web Search Results
Most current search engines present the user a ranked list given the submitted user query. Top ranked search results generally cover few aspects of all search results. However, in many cases, the users are interested in the main themes of search results besides the ranked list so that the user will have a global view of search results. This goal is often achieved through clustering approaches. ...
متن کاملEvaluation of Personalized Concept-Based Search and Ranked Lists over Linked Open Data
Linked Open Data (LOD) provides a rich structured data. As the size of LOD grows, accessing the right information becomes more challenging. Especially, the commonly used ranked lists presentation of current LOD search engines is not effective for search tasks in unfamiliar domains. Recently, combination of clustering and personalized search gained more attention for this purpose. In this paper,...
متن کاملEvaluating subtopic retrieval methods: Clustering versus diversification of search results
To address the inability of current ranking systems to support subtopic retrieval, two main post-processing techniques of search results have been investigated: clustering and diversification. In this paper we present a comparative study of their performance, using a set of complementary evaluation measures that can be applied to both partitions and ranked lists, and two specialized test collec...
متن کامل